A Simple Algorithm for Exact Multinomial Tests

نویسندگان

چکیده

This work proposes a new method for computing acceptance regions of exact multinomial tests. From this an algorithm is derived, which finds p-values tests simple hypotheses. Using concepts from discrete convex analysis, the proven to be various popular test statistics, including Pearson’s Chi-square and log-likelihood ratio. The proposed improves greatly on naive approach using full enumeration sample space. However, its use limited distributions with small number categories, as runtime grows exponentially in possible outcomes. applied simulation study, uses forecast evaluation are outlined. Additionally, properties statistic probability ordering, referred “exact test” by some authors, investigated discussed. implemented accompanying R package ExactMultinom. Supplementary materials article available online.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A simple exact separation algorithm for 2-matching inequalities

In this work we present an exact separation algorithm for the so called 2-matching inequalities, otherwise known as parity or co-circuit inequalities. The algorithm is quite simple since it operates on the tree of min-cuts of the support graph of the solution to separate, relative to an ad hoc capacity vector. The order of this algorithm is O(|V |).

متن کامل

A SIMPLE ALGORITHM FOR COMPUTING TOPOLOGICAL INDICES OF DENDRIMERS

Dendritic macromolecules’ have attracted much attention as organic examples of well-defined nanostructures. These molecules are ideal model systems for studying how physical properties depend on molecular size and architecture. In this paper using a simple result, some GAP programs are prepared to compute Wiener and hyper Wiener indices of dendrimers.

متن کامل

A SIMPLE ALGORITHM FOR COMPUTING DETOUR INDEX OF NANOCLUSTERS

Let G be the chemical graph of a molecule. The matrix D = [dij ] is called the detour matrix of G, if dij is the length of longest path between atoms i and j. The sum of all entries above the main diagonal of D is called the detour index of G. In this paper, a new algorithm for computing the detour index of molecular graphs is presented. We apply our algorithm on copper and silver nanoclusters ...

متن کامل

Simple Estimators for Semiparametric Multinomial Choice Models

This paper considers estimation of the coe¢ cients in a semiparametric multinomial choice model with linear indirect utility functions (with common coe¢ cients but di¤ering regressors) and errors that are assumed to be independent of the regressors. This implies that the conditional mean of the vector of dependent indicator variables is a smooth and invertible function of a corresponding vector...

متن کامل

A Multinomial Error Model for Tests with Polytomous Items∗

This paper introduces a multinomial error model, which models the raw scores from polytomously scored items. The multinomial error model is implemented in this paper for estimating conditional standard errors of measurement and reliability for both raw and scale scores. A simulation study is presented, which suggests that the multinomial conditional standard errors of measurement for the raw an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Graphical Statistics

سال: 2022

ISSN: ['1061-8600', '1537-2715']

DOI: https://doi.org/10.1080/10618600.2022.2102026